Ensemble-based constrained optimization using an exterior penalty method
نویسندگان
چکیده
منابع مشابه
Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization
At each outer iteration of standard Augmented Lagrangian methods one tries to solve a box-constrained optimization problem with some prescribed tolerance. In the continuous world, using exact arithmetic, this subproblem is always solvable. Therefore, the possibility of finishing the subproblem resolution without satisfying the theoretical stopping conditions is not contemplated in usual converg...
متن کاملA Penalty-free Method for Equality Constrained Optimization
A penalty-free method is introduced for solving nonlinear programming with nonlinear equality constraints. This method does not use any penalty function, nor a filter. It uses trust region technique to compute trial steps. By comparing the measures of feasibility and optimality, the algorithm either tries to reduce the value of objective function by solving a normal subproblem and a tangential ...
متن کامل1.5-Q-superlinear convergence of an exterior-point method for constrained optimization
We introduce and analyze an exterior-pointmethod (EPM) for constrained optimization problems with both inequality constraints and equations. We show that under the standard second-order optimality conditions the EPM converges to the primal–dual solution with 1.5-Q-superlinear rate.
متن کاملThreshold Based Penalty Functions for Constrained Multiobjective Optimization
This paper compares the performance of our recently proposed threshold based penalty function against its dynamic and adaptive variants. These penalty functions are incorporated in the update and replacement scheme of the multiobjective evolutionary algorithm based on decomposition (MOEA/D) framework to solve constrained multiobjective optimization problems (CMOPs). As a result, the capability ...
متن کاملAn Adaptive Penalty Approach for Constrained Genetic-Algorithm Optimization
In this paper we describe a new adaptive penalty approach for handling constraints in genetic algorithm optimization problems. The idea is to start with a relatively small penalty coefficient and then increase it or decrease it on demand as the optimization progresses. Empirical results in several engineering design domains demonstrate the merit of the proposed approach.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Petroleum Science and Engineering
سال: 2021
ISSN: 0920-4105
DOI: 10.1016/j.petrol.2021.109165